Lattice point methods for combinatorial games
نویسندگان
چکیده
منابع مشابه
Lattice Point Methods for Combinatorial Games
We encode arbitrary finite impartial combinatorial games in terms of lattice points in rational convex polyhedra. Encodings provided by these lattice games can be made particularly efficient for octal games, which we generalize to squarefree games. These additionally encompass all heap games in a natural setting, in which the Sprague–Grundy theorem for normal play manifests itself geometrically...
متن کاملHandbook of Combinatorial Optimization Interior Point Methods for Combinatorial Optimization
3 Solution techniques 13 3.1 Combinatorial approach : : : : : : : : : : : : : : : : : : : : : : : : : : 13 3.2 Continuous approach : : : : : : : : : : : : : : : : : : : : : : : : : : : : 14 3.2.1 Examples of embedding : : : : : : : : : : : : : : : : : : : : : : 14 3.2.2 Global approximation : : : : : : : : : : : : : : : : : : : : : : : 15 3.2.3 Continuous trajectories : : : : : : : : : : : : : ...
متن کاملInterior Point Methods for Combinatorial Optimization
Research on using interior point algorithms to solve combinatorial optimization and integer programming problems is surveyed. This paper discusses branch and cut methods for integer programming problems, a potential reduction method based on transforming an integer programming problem to an equivalent nonconvex quadratic programming problem, interior point methods for solving network flow probl...
متن کاملSecond-order Quantile Methods for Experts and Combinatorial Games
We aim to design strategies for sequential decision making that adjust to the difficulty of the learning problem. We study this question both in the setting of prediction with expert advice, and for more general combinatorial decision tasks. We are not satisfied with just guaranteeing minimax regret rates, but we want our algorithms to perform significantly better on easy data. Two popular ways...
متن کاملCombinatorial Boundary Tracking of a 3 D Lattice Point Set
Boundary tracking and surface generation are ones of main topological topics for threedimensional digital image analysis. However, there is no adequate theory to make relations between these different topological properties in a completely discrete way, In this paper, we present a new boundary tracking algorithm which gives not only a set of border points but also the surface structures by usin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2011
ISSN: 0196-8858
DOI: 10.1016/j.aam.2010.10.004